Perfect Secrecy in Wireless Networks
نویسندگان
چکیده
In a classic paper, among a multitude of other security issues, Claude E. Shannon defined perfect secrecy for a pair of secure computers communicating over an insecure link. The present paper extends Shannon’s notion of perfect secrecy to ad hoc wireless networks of computers. All of the wireless transmissions are insecure. This paper assumes a secure base-station communicating wirelessly using symmetric encryption with physically insecure autonomous computers. These wireless communications use a common symmetric encryption algorithm. Each of the computers has a unique fixed key. The base station has a copy of each key. This scenario gives way to a generalization of Shannon’s perfect secrecy. This generalizes to t-perfect secrecy which is directly based on t-wise independence. This gives another natural application of t-wise independence to cryptography. Finally, transmission noise, message collisions, and other issues are briefly discussed with respect to this generalization of Shannon’s perfect secrecy.
منابع مشابه
Security Analysis of Lightweight Authentication Scheme with Key Agreement using Wireless Sensor Network for Agricultural Monitoring System
Wireless sensor networks have many applications in the real world and have been developed in various environments. But the limitations of these networks, including the limitations on the energy and processing power of the sensors, have posed many challenges to researchers. One of the major challenges is the security of these networks, and in particular the issue of authentication in the wireles...
متن کاملA Lightweight Anonymous Authentication Protocol with Perfect Forward Secrecy for Wireless Sensor Networks
Due to their frequent use in unattended and hostile deployment environments, the security in wireless sensor networks (WSNs) has attracted much interest in the past two decades. However, it remains a challenge to design a lightweight authentication protocol for WSNs because the designers are confronted with a series of desirable security requirements, e.g., user anonymity, perfect forward secre...
متن کاملInformation-Theoretic Secrecy for Wireless Networks
The aim of information-theoretic secrecy is to ensure that an eavesdropper who listens to the wireless transmission of a message can only collect an arbitrarily small number of information bits about this message. In contrast to cryptography, there are no assumptions on the computational power of the eavesdropper. Information-theoretically secret communication has been studied for many particul...
متن کاملMultiple Antenna Secure Broadcast over Wireless Networks
In wireless data networks, communication is particularly susceptible to eavesdropping due to its broadcast nature. Security and privacy systems have become critical for wireless providers and enterprise networks. This paper considers the problem of secret communication over the Gaussian broadcast channel, where a multi-antenna transmitter sends independent confidential messages to two users wit...
متن کاملProviding perfect forward secrecy for location-aware wireless sensor networks
Sensor nodes are resource-constrained, such as low battery life, computation, bandwidth and memory, so traditional public key schemes are impractical in wireless sensor networks. In the previous schemes, symmetric cryptography is the most common method used in sensor nodes. How to distribute keys into every sensor node is an important issue in many applications for hierarchical sensor networks....
متن کامل